A Tree Partitioning Algorithm for Activity Formation in Aggregate Scheduling
نویسندگان
چکیده
In project-oriented production systems where hundreds of thousands of operations are carried out each month subject to precedence and resource constraints, long-term scheduling is a challenging problem for any branch of operation research or artificial intelligence. In a dynamically changing environment, fixing a schedule for several months in advance would be pointless, and, furthermore, the solution of the explicit scheduling problem on atomic operations could easily turn computationally prohibitive. The customary technique at this point is aggregation. In this paper we address aggregate scheduling in components manufacturing, where the operation precedence graphs of projects form trees, and there are no alternative routings.
منابع مشابه
ارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملAn Integrated Aggregate Production Planning Model with Two-Phase Production System and Maintenance Costs
Aggregate production planning (APP) is one of the most important issues carried out in manufacturing environments which seeks efficient planning, scheduling and coordination of all production activities that optimizes the company's objectives. In this paper, we develop a mixed integer linear programming (MILP) model for an integrated aggregate production planning system with closed loop supply ...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کامل